翻訳と辞書 Words near each other ・ Nestor Khergiani ・ Nestor Kotlyarevsky ・ Nestor Kukolnik ・ Nestor L'Hôte ・ Nestor Lakoba ・ Nestor Leynes ・ Nestor Léon Marchand ・ Nestor Makhno ・ Nestor Mata ・ Nested sampling algorithm ・ Nested set model ・ Nested SQL ・ Nested stack automaton ・ Nested transaction ・ Nested triangles graph ・ Nested word ・ Nestedness ・ NestEgg ・ Nestegis ・ Nestegis apetala ・ Nestegis cunninghamii ・ Nestegis lanceolata ・ Nestegis montana ・ Nestegis sandwicensis ・ Nestelbach bei Graz ・ Nestelbach im Ilztal ・ Nestelberg (Wasgau) ・ Nestell Kipp Anderson ・ Nester ・ Nester (emulator) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Nested word ： ウィキペディア英語版 Nested word In computer science, more specifically in automata and formal language theory, nested words are a concept proposed by Alur and Madhusudan as a joint generalization of words, as traditionally used for modelling linearly ordered structures, and of ordered unranked trees, as traditionally used for modelling hierarchical structures. Finite-state acceptors for nested words, so-called nested word automata, then give a more expressive generalization of finite automata on words. The linear encodings of languages accepted by finite nested word automata gives the class of visibly pushdown languages. The latter language class lies properly between the regular languages and the deterministic context-free languages. Since their introduction in 2004, these concepts have triggered much research in that area.〔(Google Scholar search results ) for "nested words" OR "visibly pushdown"〕 ==Formal definition== To define ''nested words'', we first need to define ''matching relation''. As usual, for a nonnegative integer $\backslash ell$, we use the notation $()$ to denote the set $\backslash$, with the special case $()=\backslash emptyset$. A ''matching relation'' ↝ of length $\backslash ell\backslash ge\; 0$ is a subset of $\backslash \backslash times\backslash$ such that: # all nesting edges are forward, that is, if ''i'' ↝ ''j'' then ''i''<''j''; # nesting edges never have a finite position in common, that is, for -∞ < ''i'' < ∞, there is at most one position ''h'' such that ''h'' ↝ ''i'', and there is at most one position ''j'' such that ''i'' ↝ ''j''; and # nesting edges never cross, that is, we can't find ''i''<''i''’≤''j''<''j''’ such that both ''i'' ↝ ''j'' and ''i''’ ↝ ''j''’. A position ''i'' is referred to as * a ''call position'', if ''i'' ↝ ''j'' for some ''j'', * a ''pending call'' if ''i'' ↝ ∞, * a ''return position'', if ''h'' ↝ ''i'' for some ''h'', * a ''pending return'' if -∞ ↝ ''i'', and * an ''internal position'' in all remaining cases. A ''nested word'' of length $\backslash ell$ over an alphabet Σ is a pair (''w'',↝), where ''w'' is a word of length $\backslash ell$over Σ (in the usual sense) and ↝ is a matching relation of length $\backslash ell$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Nested word」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.